BBS generator using the function x 2 − 2 ( mod n ) Raúl DURÁN
نویسنده
چکیده
A BBS-like generator is discussed for which the quadratic function F : x 7→ x − 2 (mod n), where n = p · q is the product of two distinct primes, is used. The maximal cycle length of the orbits produced by iterating F is obtained and the particular important cases in which p, q are both 1and 2-safe are analyzed in deeper detail.
منابع مشابه
A practical “perfect” pseudo-random number generator
The “x2 mod N” generator, also known as the BBS generator [2], has a strong theoretical foundation from the computational complexity theory and the number theory. Proofs were given that, under certain reasonable assumptions on which modern cryptography heavily relies, the BBS pseudo-random sequences would pass any feasible statistical test. Unfortunately, the algorithm was found to be too slow ...
متن کاملOn the Period of the Linear Congruential and Power Generators
This sequence was first considered as a pseudorandom number generator by D. H. Lehmer. For the power generator we are given integers e, n > 1 and a seed u = u0 > 1, and we compute the sequence ui+1 = u e i (mod n) so that ui = u ei (mod n). A popular case is e = 2, which is called the Blum–Blum–Shub (BBS) generator. Both of these generators are periodic sequences, and it is of interest to compu...
متن کاملOn the Period of the Linear Congruential and Power Generators Pär Kurlberg and Carl Pomerance
This sequence was first considered as a pseudorandom number generator by D. H. Lehmer. For the power generator we are given integers e, n > 1 and a seed u0 > 1, and we compute the sequence ui+1 = u e i (mod n) so that ui = u ei 0 (mod n). A popular case is e = 2, which is called the Blum–Blum–Shub (BBS) generator. Both of these generators are periodic sequences, and it is of interest to compute...
متن کاملLower Bounds on the Period of Some Pseudorandom Number Generators
We are interested in obtaining lower bounds on the periods of two standard pseudorandom number generators from number theory—the linear congruential generator, first introduced by D. H. Lehmer, and the so called power generator. For the former, given integers e, b, n (with e, n > 1) and a seed u = u0, we compute the sequence ui+1 = eui + b (mod n). For the power generator, given integers e, n >...
متن کاملThe ANF of the Composition of Addition and Multiplication mod 2n with a Boolean Function
Compact formulas are derived to represent the Algebraic Normal Form (ANF) of f(x + a mod 2) and f(x × a mod 2) from the ANF of f , where f is a Boolean function on F2 and a is a constant of F2 . We compare the algebraic degree of the composed functions with the algebraic degree of the original function f . As an application, the formula for addition modulo 2 is applied in an algebraic attack on...
متن کامل